Join Algorithm Using Multiple Replicas in Data Grid
نویسندگان
چکیده
We address the issue of applying join operation to the relational data managed in the form of multiple replicas in data grid. A join algorithm is developed that solves the problem of replica matching and execution node selection by making use of matching theory. To ease the data transference among the grid nodes, we introduce relation reduction and row blocking techniques. The analytical and experimental results depict the effectiveness of the proposed join algorithm for the better network transfer rate and the efficient processing of replicated data to improve query responses in data grid.
منابع مشابه
Improving Data Grids Performance by Using Modified Dynamic Hierarchical Replication Strategy
Abstract: A Data Grid connects a collection of geographically distributed computational and storage resources that enables users to share data and other resources. Data replication, a technique much discussed by Data Grid researchers in recent years creates multiple copies of file and places them in various locations to shorten file access times. In this paper, a dynamic data replication strate...
متن کاملIncreasing performance in Data grid by a new replica replacement algorithm
Data Grid provides sharing services for very large data around the world. Data replication is one of the most effective approaches to reduce access latency and response time. In addition to the benefits, replication has costs such as storage and bandwidth consumption, especially when storage space is low and limited. Therefore, the data replacement should be done wisely. In this p...
متن کاملP2P Based Decentralized Dynamic Replica Placement Strategy in Data Grid Environment
A big challenge to the grid computing is the communication on the network. The proper placement for replicas on multiple nodes in P2P or grid environment is an effective way to decrease network cost and improve communication efficiency. The unstable peers, networks, and fluctuant user access mode in the distributed environment make replica placement optimization difficult. We construct a networ...
متن کاملP2P Based Decentralized Dynamic Replica Placement Strategy in Grid Environment
A big challenge to the grid computing is the communication on the network. The proper placement for replicas on multiple nodes in P2P or grid environment is an effective way to decrease network cost and improve communication efficiency. The unstable peers, networks, and fluctuant user access mode in the distributed environment make replica placement optimization difficult. We construct a networ...
متن کاملGeneralization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones
One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and delay occasioned by the size of Internet. Replication enables us to meet such a challenge with success. In the context of weak consistency, the fast consistency algorithm prioritizes replicas with high demand. Nevertheless, the fa...
متن کامل